Automated Algorithm Tuning using F-races: Recent Developments

Many state-of-the-art algorithms for tackling computationally hard problems have a number of parameters that influence their search behavior. Such algorithms include exact algorithms like branch-and-bound algorithms, algorithm packages like CPLEX for integer programming, and also approximate algorithms such as virtually all metaheuristics. Examples of parameters are numerical parameters such as the tabu list length in tabu search algorithms or the pheromone evaporation rate in ant colony optimization. Many algorithms can also be seen as being composed of a set of specific components that are often interchangeable. Examples here are branching strategies in branch-and-bound algorithms or different types of cross-over operators in evolutionary algorithms; hence, these components are possible levels of categorical algorithm parameters.